Generalized Pascal Matrices and Inverses Using One-to-One Rational Polynomial s-z Transformations
نویسندگان
چکیده
Abstract: This paper proposes a one-to-one mapping between the coefficients of continuous-time (s-domain) and discrete-time (z-domain) IIR transfer functions such that the s-domain numerator/denominator coefficients can be uniquely mapped to the z-domain numerator/denominator coefficients, and vice versa. The one-to-one mapping provides a firm basis for proving the inverses of the so-called generalized Pascal matrices from various first-order s-z transformations.
منابع مشابه
Rational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کاملComputing Generalized Inverse Systems Using Matrix Pencil Methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the MoorePenrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computati...
متن کاملOn computing generalized inverse systems using matrix pencil methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state space representation. We put a particular emphasis on two classes of inverses: the week generalized inverse and the MoorePenrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computa...
متن کاملEffective partitioning method for computing generalized inverses and their gradients
We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that ...
متن کاملThe reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules
Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008